Robot Hardware for Dismantling.
نویسندگان
چکیده
منابع مشابه
A Hardware Architecture for Robot Path Planning
Robot paths can be planned in quantized configuration spaces. Each configuration represents an unique location of the robot. If a matrix of prohibited and permitted transitions is available, paths can be found in the configuration space by heuristic search algorithms. We have studied algorithms and architectures for finding these paths. We propose a hardware architecture that uses an implementa...
متن کاملMorphogenetic Evolvable Hardware Controllers for Robot Walking
We propose to develop reactive robot leg controllers in hardware using a morphogenetic approach that incorporates both evolutionary and developmental processes. Evolvable hardware has been crippled by issues of scalability and viability of evolved designs that arise when evolving complex circuits on modern mainstream field programmable gate arrays (FPGAs). To overcome these limitations requires...
متن کاملConstructing rules for dismantling ships.
Labor groups, environmental activists, and shipping experts have begun finalizing international guidelines that would reduce threats from toxic substances released during the ship scrapping process and would protect the health and safety of laborers who dismantle ships. In June 2001, government representatives and stakeholders in the ship dismantling industry gathered in Geneva, Switzerland, to...
متن کاملDismantling Lamarckism
This paper addresses the widespread tendency to describe socio-economic evolution as Lamarckian. The difference between Lamarckian and Darwinian replication is clarified. It is shown that a phenotype-genotype distinction must first be established before we can identify Lamarckian transmission. To qualify as Lamarckian inheritance, acquired properties at the phenotypic level must be encoded in a...
متن کاملNetwork dismantling
We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Robotics Society of Japan
سال: 1995
ISSN: 0289-1824,1884-7145
DOI: 10.7210/jrsj.13.486